Predicative Frege Arithmetic and 'Everyday' Mathematics
نویسندگان
چکیده
منابع مشابه
Predicative fragments of Frege Arithmetic
Frege Arithmetic (FA) is the second-order theory whose sole non-logical axiom is Hume’s Principle, which says that the number of F s is identical to the number of Gs if and only if the F s and the Gs can be one-to-one correlated. According to Frege’s Theorem, FA and some natural definitions imply all of second-order Peano Arithmetic. This paper distinguishes two dimensions of impredicativity in...
متن کاملThe predicative Frege hierarchy
In this paper, we characterize the strength of the predicative Frege hierarchy, PV, introduced by John Burgess in his book [Bur05]. We show that PV and Q + con(Q) are mutually interpretable. It follows that PV := PV is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [Gan06] using a different proof. Another consequence of the our main result is that PV is mutually i...
متن کاملPredicative Logic and Formal Arithmetic
After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell’s Principia Mathematica with the axiom of infinity but without the axiom of reducibility. 1 Historical introduction After discovering the inconsistency in Frege’s Grundgesetze der Arithmetik, Russell proposed two changes: first, dropping the assumption that to every h...
متن کاملPredicative foundations of arithmetic
Predicative mathematics in the sense originating with Poincaré and Weyl begins by taking the natural number system for granted, proceeding immediately to real analysis and related fields. On the other hand, from a logicist or set-theoretic standpoint, this appears problematic, for, as the story is usually told, impredicative principles seem to play an essential role in the foundations of arithm...
متن کاملRamified Frege Arithmetic
Frege’s definitions of zero, predecession, and natural number will be explained below. As for second-order Dedekind-Peano arithmetic, the axiomatization most convenient for our purposes is the following: (1) N0 (2) Nx∧Pxy→ Ny (3) ∀x∀y∀z(Nx∧Pxy∧Pxz→ y = z) (4) ∀x∀y∀z(Nx∧Ny∧Pxz∧Pyz→ x = y) (5) ¬∃x(Nx∧Px0) (6) ∀x(Nx→∃y(Pxy)) (7) ∀F(F0∧∀x∀y(Nx∧Fx∧Pxy→ Fy)→∀x(Nx→ Fx) If (slightly non-standardly) we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophia Mathematica
سال: 2014
ISSN: 0031-8019,1744-6406
DOI: 10.1093/philmat/nkt045